1020A - New Building for SIS - CodeForces Solution


math *1000

Please click on ads to support us..

C++ Code:

#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#define ll long long
using namespace std;
int main(){
    int n, h, a, b, k;
    cin>>n>>h>>a>>b>>k;
    while(k--){
        int floor[4];
        for(int i=0; i<4; i++){
            cin>>floor[i];
        }
        if(floor[0]==floor[2]){
            cout<<abs(floor[3]-floor[1])<<endl;
        }
        else{
            int count=abs(floor[2]-floor[0]);
            if(floor[1]>=a && floor[1]<=b){
                cout<<count+abs(floor[3]-floor[1])<<endl;
            }
            else if(floor[1]<a){
                cout<<abs(floor[1]-a)+count+abs(a-floor[3])<<endl;
            }
            else if(floor[1]>b){
                cout<<abs(floor[1]-b)+count+abs(floor[3]-b)<<endl;
            }
        }
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal